منابع مشابه
An iterative, dynamically stabilized method of data unfolding
We propose a new iterative unfolding method for experimental data, making use of a regularization function. The use of this function allows one to build an improved normalization procedure for Monte Carlo spectra, unbiased by the presence of possible new structures in data. We are able to unfold, in a dynamically stable way, data spectra which can be strongly affected by fluctuations in the bac...
متن کاملA New Two-stage Iterative Method for Linear Systems and Its Application in Solving Poisson's Equation
In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system...
متن کاملCoding Method for Parallel Iterative Linear Solver
Computationally intensive distributed and parallel computing is often bottlenecked by a small set of slow workers known as stragglers. In this paper, we utilize the emerging idea of “coded computation” to design a novel error-correctingcode inspired technique for solving linear inverse problems under specific iterative methods in a parallelized implementation affected by stragglers. Example app...
متن کاملA new iterative method for solving linear systems
The Jacobi and Gauss-Seidel iterative methods are among iterative methods for solving linear system of equations. In this paper, a new iterative method is introduced, it is based on the linear combination of old and most recent calculated solutions. The new method can be considered as a general method, where the Jacobi and Gauss-Seidel methods as two special cases of it. Some convergence proper...
متن کاملA non-iterative method for solving non-linear equations
In this paper, using a hyperbolic tangent function tanhðbxÞ, b > 0, we develop a non-iterative method to estimate a root of an equation f(x) = 0. The problem of finding root is transformed to evaluating an integral, and thus we need not take account of choosing initial guess. The larger the value of b, the better the approximation to the root. Alternatively we employ the signum function sgnðxÞ ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2012
ISSN: 1742-6596
DOI: 10.1088/1742-6596/368/1/012043